Protecting a multicast session against single link failures in a mesh network

نویسندگان

  • Narendra K. Singhal
  • Laxman H. Sahasrabuddhe
  • Biswanath Mukherjee
چکیده

In this report, we investigate approaches and algorithms for establishing a multicast session in a mesh network while protecting the session against any single link failure, e.g., a fiber cut in an optical network. We propose two new and efficient approaches for protecting a multicast session: 1) segment protection in which we protect each segment in the primary tree separately (rather than the entire tree) and allow these backup segments to share arcs with the other existing primary and backup segments; and 2) path-pair protection in which we protect a path between each source-destination pair by finding a disjoint backup path. Unlike previous schemes such as finding linkdisjoint trees and arc-disjoint trees, our new schemes 1) guarantee a solution where previous schemes fail and 2) find efficient solution requiring less network resources. Our algorithm, based on the path-pair protection scheme, called optimal path-pair-based shared disjoint paths (OPP SDP) algorithm, finds a solution if such a solution exists and outperforms all the other schemes in terms of network cost. We also show that OPP SDP performs close to the optimal solution obtained by solving a mathematical formulation of the problem expressed as an Integer Linear Program (ILP).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Provisioning of Survivable Multicast Sessions Against Single Link Failures in Optical WDM Mesh Networks

In this paper, we investigate approaches and algorithms for establishing a multicast session in a mesh network while protecting the session against any single link failure, e.g., a fiber cut in an optical network. First, we study these approaches and algorithms to protect a single multicast tree in a mesh network and then extend it to dynamically provision survivable multicast connections (wher...

متن کامل

Resilient Multicasting in Wireless Mesh Networks

To support reliable multicast routing in wireless mesh networks, it is important to protect multicast sessions against link or node failures. In this paper, we propose a resilient forwarding mesh approach for protecting a multicast session. Utilizing the wireless broadcast advantage, a resilient forwarding mesh effectively establishes two node disjoint paths for each source-destination pair. Th...

متن کامل

Algorithms for Provisioning Survivable Multicast Sessions against Link Failures in Mesh Networks

In this paper, we investigate new algorithms for efficiently establishing a multicast session in a mesh network while protecting the session from a link failure, e.g., a fiber cut in an optical network. First, we study these algorithms for protecting a multicast tree in a mesh network and then extend them for dynamic provisioning of survivable multicast connections where connections come and go...

متن کامل

Evaluating Multipath TCP Resilience against Link Failures

Standard TCP is the de facto reliable transfer protocol for the Internet. It is designed to establish a reliable connection using only a single network interface. However, standard TCP with single interfacing performs poorly due to intermittent node connectivity. This requires the re-establishment of connections as the IP addresses change. Multi-path TCP (MPTCP) has emerged to utilize multiple ...

متن کامل

Survivability schemes for optical backbone and access networks

Network survivability, reflecting the ability of a network to maintain an acceptable level of service during and after failures, is an important requirement for WDM optical networks due to the ultrahigh capacity. The most common network failure is the link failure which could cause enormous data loss and lots of service disruption to Internet users. Although single-link failures are the most co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003